Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints

In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

INTELLIGENT DECISION ALGORITHM FOR FAULT DETECTION AND ITS APPLICATION

ＩＮＴＥＬＬＩＧＥＮＴＤＥＣＩＳＩＯＮＡＬＧＯＲＩＴＨＭＦＯＲＦＡＵＬＴＤＥＴＥＣＴＩＯＮＡＮＤＩＴＳＡＰＰＬＩＣＡＴＩＯＮＷｕＪｉａｎｊｕｎ;ＺｈａｎｇＹｕｌｉｎ;ＣｈｅｎＱｉｚｈｉ（ＤｅｐａｒｔｍｅｎｔｏｆＡｅｒｏｓｐａｃｅＴｅｃｈｎｏｌｏｇｙ,...     

C~3I 系统中基于多目标决策理论的对空攻击任务分配决策问题研究

根据多目标决策理论,从系统的角度出发,提出了防御权系数问题,并在此基础上研究对空攻击任务的分配策略,给出了效度最大攻击任务分配策略和重点防护目标优先攻击任务分配策略,并引入攻击强度阀值概念,对这两种分配策略进行了改进,最后给出了具体算法。     

一种用于 C~3I 系统的异类传感器数据融合算法

在文献〔８〕和〔９〕基础上研究了在不等样本情况下的异类传感器——雷达与ＥＳＭ——的航迹相关问题。首先,基于模糊综合函数找出两个最可能的雷达与ＥＳＭ航迹相关对,然后,利用统计理论并采用多门限决策方法进行雷达与ＥＳＭ航迹相关判决。仿真结果表明,与文献〔８〕的方法相比,在雷达航迹比较多的情况下,本文所提出的在不等样本情况下的雷达与ＥＳＭ相关算法具有与其很相近的性能,但计算量明显减少;而与文献〔９〕的方法相比,这里采用多门限决策方法又可同时减小两类错误概率。     

正规战中作战效率变化初探

本文以描述常规战最基本的模型——Lanchester方程为基础,就影响作战效率的一些因素进行了分析并定量化地表现在作战模型中,然后运用有关系统学理论讨论了作战效率变化对战斗进程的影响程度。     

基于熵权的导弹型号论证方案评价模型

针对导弹型号论证决策中的部分属性信息具有模糊性,给出了一种基于熵权的模糊信息多目标决策方案评估方法。该方法在只有模糊判断矩阵而没有专家权重的情况下,通过多指标的模糊评价矩阵的熵权计算,得到各属性信息提供的有用信息量的程度;再通过各方案与理想点的距离,得出了可信度较高的优选方案。     

基于0-1规划的弹种决策与发射时序优化

对于身管发射武器系统,同一发射单元使用不同弹种完成作战任务时,需要确立合适的弹种决策与最佳的发射时机.提出用O-1变量来描述弹种决策变量.通过时弹种发射机制及武器系统控制特点进行分析,构造多种0-1变量用以描述武器系统作战时序之间的约束关系,建立了弹种发射时序的0-1规划模型,并用LINGO软件实现了0-1规划的求解.给出了典型应用实例,进行了仿真计算,结果表明,该方法简单可行.     

Replacing nonidentical vital components to extend system life

We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于大数据的战区联合作战装备保障决策

大数据技术在决策领域的不断应用,将给装备保障决策方式带来重大变革。本文研究基于大数据的战区联合作战装备保障决策问题,提升信息化条件下装备保障准确、高效的决策方式等方面发挥重大作用。阐述了大数据的基本内涵,在决策领域的应用价值。通过系统推理的方法对战区联合作战装备保障决策的分析,提出基于大数据的战区联合作战装备保障决策基本构想,画出科学决策过程示意图,构建大数据战区联合作战装备保障辅助决策系统。结合研究大数据在战区联合作战装备保障决策领域的现实情况,提出相对应的措施建议。